Gmres , L - Curves , and Discrete Ill - Posed Problems ∗
نویسنده
چکیده
The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. This paper discusses application of the GMRES method to the solution of large linear systems of equations that arise from the discretization of linear ill-posed problems. These linear systems are severely ill-conditioned and are referred to as discrete ill-posed problems. We are concerned with the situation when the right-hand side vector is contaminated by measurement errors, and we discuss how a meaningful approximate solution of the discrete ill-posed problem can be determined by early termination of the iterations with the GMRES method. We propose a termination criterion based on the condition number of the projected matrices defined by the GMRES method. Under certain conditions on the linear system, the termination index corresponds to the “vertex” of an L-shaped curve. AMS subject classification: 65F10, 65F22.
منابع مشابه
FGMRES for linear discrete ill-posed problems
GMRES is one of the most popular iterative methods for the solution of large linear systems of equations. However, GMRES generally does not perform well when applied to the solution of linear systems of equations that arise from the discretization of linear ill-posed problems with error-contaminated data represented by the right-hand side. Such linear systems are commonly referred to as linear ...
متن کاملSolving Ill-Posed Linear Systems with GMRES and a Singular Preconditioner
Almost singular linear systems arise in discrete ill-posed problems. Either because of the intrinsic structure of the problem or because of preconditioning, the spectrum of the coefficient matrix is often characterized by a sizable gap between a large group of numerically zero eigenvalues and the rest of the spectrum. Correspondingly, the right-hand side has leading eigencomponents associated w...
متن کاملSome properties of range restricted GMRES methods
The GMRES method is one of the most popular iterative schemes for the solution of large linear systems of equations with a square nonsingular matrix. GMRES-type methods also have been applied to the solution of linear discrete ill-posed problems. Computational experience indicates that for the latter problems variants of the standard GMRES method, that require the solution to live in the range ...
متن کاملCompact Linear Operators and Krylov Subspace Methods
This thesis deals with linear ill-posed problems related to compact operators, and iterative Krylov subspace methods for solving discretized versions of these. Linear compact operators in infinite dimensional Hilbert spaces will be investigated and several results on the singular values and eigenvalues for such will be presented. A large subset of linear compact operators consists of integral o...
متن کاملNoise Propagation in Regularizing Iterations for Image Deblurring
We use the two-dimensional discrete cosine transform to study how the noise from the data enters the reconstructed images computed by regularizing iterations, that is, Krylov subspace methods applied to discrete ill-posed problems. The regularization in these methods is obtained via the projection onto the associated Krylov subspace. We focus on CGLS/LSQR, GMRES, and RRGMRES, as well as MINRES ...
متن کامل